A linear time algorithm to compute the drainage network on grid terrains
نویسندگان
چکیده
منابع مشابه
A Parallel Algorithm for Viewshed Computation on Grid Terrains
Viewshed (or visibility map) computation is an important component in many GIScience applications and, as nowadays there are huge volume of terrain data available at high resolutions, it is important to develop efficient algorithms to process these data. Since the main improvements on modern processors come from multi-core architectures, parallel programming provides a promising means for devel...
متن کاملAn Efficient Algorithm to Compute the Viewshed on DEM Terrains Stored in the External Memory
Nowadays, there is a huge volume of data about terrains available and generally, these data do not fit in the internal memory. So, many GIS applications require efficient algorithms to manipulate the data externally. One of these applications is the viewshed computation that consists in obtain the visible points from a given point p. In this paper, we present an efficient algorithm to compute t...
متن کاملon the effect of linear & non-linear texts on students comprehension and recalling
چکیده ندارد.
15 صفحه اولA linear time algorithm to compute the impact of all the articulation points
The articulation points of an undirected connected graphs are those vertices whose removal increases the number of connected components of the graph, i.e. the vertices whose removal disconnects the graph. However, not all the articulation points are equal: the removal of some of them might end in a single vertex disconnected from the graph, whilst in other cases the graph can be split in severa...
متن کاملAn O(n) Time Algorithm to Compute the Bisection Width of Solid Grid Graphs
The bisection problem asks for a partition of the n vertices of a graph into two sets of size at most dn/2e, so that the number of edges connecting the two sets is minimised. A grid graph is a finite connected subgraph of the infinite two-dimensional grid. It is called solid if it has no holes. Papadimitriou and Sideri [7] gave an O(n) time algorithm to solve the bisection problem on solid grid...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Hydroinformatics
سال: 2013
ISSN: 1464-7141,1465-1734
DOI: 10.2166/hydro.2013.068